منابع مشابه
Concurrent Locomotive Assignment and Freight Train Scheduling
The locomotive assignment and the freight train scheduling are important problems in railway transportation. Freight cars are coupled to form a freight rake. The freight rake becomes a train when a locomotive is coupled to it. The locomotive assignment problem assigns locomotives to a set of freight rakes in a way that, with minimum locomotive deadheading time, rake coupling delay and locomotiv...
متن کاملThe Solo Operating System: A Concurrent Pascal Program
This is a description of the single-user operating system Solo written in the programming language Concurrent Pascal. It supports the development of Sequential and Concurrent Pascal programs for the PDP 11/45 computer. Input/output are handled by concurrent processes. Pascal programs can call one another recursively and pass arbitrary parameters among themselves. This makes it possible to use P...
متن کاملPartially-Concurrent Open Shop Scheduling
The partially-concurrent open shop scheduling problem is presented. The standard open shop scheduling problem is generalized by allowing some operations to be processed concurrently. This generalization is directly motivated from a real-life timetabling project of assigning technicians to airplanes in an airplane garage. A schedule for the partially-concurrent problem is represented by a digrap...
متن کاملConcurrent Scheduling of Event-B Models
Event-B is a refinement-based formal method that has been shown to be useful in developing concurrent and distributed programs. Large models can be decomposed into sub-models that can be refined semi-independently and executed in parallel. In this paper, we show how to introduce explicit control flow for the concurrent sub-models in the form of event schedules. We explore how schedules can be d...
متن کاملHeuristic Scheduling of Concurrent Data Mining Queries
Execution cost of batched data mining queries can be reduced by integrating their I/O steps. Due to memory limitations, not all data mining queries in a batch can be executed together. In this paper we introduce our heuristic algorithm called CCFull, which suboptimally schedules the data mining queries into a number of separate execution phases. The algorithm significantly outperforms the optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGOPS Operating Systems Review
سال: 1978
ISSN: 0163-5980
DOI: 10.1145/775332.775335